The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

The Potts model representation and a Robinson–Schensted correspondence for the partition algebra

We construct a correspondence between the set of partitions of a finite set M and the set of pairs of walks to the same vertex on a graph giving the Bratteli diagram of the partition algebra on M. This is the precise analogue of the correspondence between the set of permutations of a finite set and the set of pairs of Young tableaux of the same shape, called the Robinson–Schensted correspondence.     

AdS/CFT duality at strong coupling

We study the strong-coupling limit of the AdS/CFT correspondence in the framework of a recently proposed fermionic formulation of the Bethe ansatz equations governing the gauge theory anomalous dimensions. We give examples of states that do not follow the Gubser-Klebanov-Polyakov law at a large ’t Hooft coupling λ, in contrast to recent results on the quantum string Bethe equations that are valid in that regime. This result indicates that the fermionic construction cannot be trusted at large λ, although it remains an efficient tool for computing the weak-coupling expansion of anomalous dimensions. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 152, No. 2, pp. 213–224, August, 2007.     

Inner-sphere oxidation of iron(II) by tris(malonato)cobaltate(III)

The kinetics of oxidation of Fe²⁺ by [Co(C₃H₂O₄)₃]^3? in acidic solutions at 605 nm showed a simple first-order dependence in each reactant concentration. The second-order rate constant dependence on [H⁺] is in accordance with eqn (i) k₂ = k′₂ + k₃[H⁺] (i) where k′₂ and k₃ have values of 73.4 ± 14.0 M ^?1 s^?1 and 353 ± 41 M^?2 s^?1, respectively, at 1.0 M ionic strength (NaClO₄) and 25°C. At 310 nm the formation and decomposition of an intermediate, believed to be [FeC₃H₂O₄]⁺, was observed. The increase in the rate of oxidation with increasing [H⁺] was interpreted in terms of a “one-ended” dissociation mechanism which facilitates chelation of Fe₂₊ by the carbonyl oxygens of malonate in the transition state.     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.